BOUNDED QUERY MACHINES: ON NP AND PSPACEBOOK RV.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 5; NO 1; PP. 27-39; BIBL. 17 REF.Article

THE POWER OF THE CHURCH-ROSSER PROPERTY FOR STRING REWRITING SYSTEMSBOOK RV.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 360-368; BIBL. 20 REF.Conference Paper

ON THE COMPLEXITY OF FORMAL GRAMMARS.BOOK RV.1978; ACTA INFORMAT.; ALLEM.; DA. 1978; VOL. 9; NO 2; PP. 171-181; BIBL. 20 REF.Article

ON LANGUAGES WITH A CERTAIN PREFIX PROPERTY.BOOK RV.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976-1977; VOL. 10; NO 3; PP. 229-237; BIBL. 16 REF.Article

ON LANGUAGES ACCEPTED BY SPACE-BOUNDED ORACLE MACHINESBOOK RV.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 2; PP. 177-185; BIBL. 13 REF.Article

POLYNOMIAL SPACE AND TRANSITIVE CLOSUREBOOK RV.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 434-439; BIBL. 9 REF.Article

ON FORMAL GRAMMARS (PRELIMINARY REPORT)BOOK RV.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 336-339; BIBL. 23 REF.Conference Paper

TRANSLATIONAL LEMMAS, POLYNOMIAL TIME AND (LOG N)³-SPACE.BOOK RV.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 3; PP. 215-226; BIBL. 14 REF.Article

COMPLEXITY CLASSES OF FORMAL LANGUAGES (PRELIMINARY REPORT)BOOK RV.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 43-56; BIBL. 24 REF.Conference Paper

A REMARK ON TALLY LANGUAGES AND COMPLEXITY CLASSESBOOK RV.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 2; PP. 198-201; BIBL. 6 REF.Article

SIMPLE REPRESENTATIONS OF CERTAIN CLASSES OF LANGUAGES.BOOK RV.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 1; PP. 23-31; BIBL. 19 REF.Article

TESTING FOR THE CHURCH-ROSSER PROPERTYBOOK RV; O'DUNLAING CP.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 223-229; BIBL. 12 REF.Article

EQUALITY SETS AND COMPLEXITY CLASSESBOOK RV; BRANDENBURG FJ.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 4; PP. 729-743; BIBL. 14 REF.Article

ON THE USE OF LINEAR LANGUAGES IN FORMAL LANGUAGE THEORY.BOOK RV; NIVAT M.sdIN: CONF. INF. SCI. SYST. PROC.; BALTIMORE; 1977; BALTIMORE; JOHNS HOPKINS UNIV.; DA. S.D.; PP. 190-194; BIBL. 14 REF.Conference Paper

MUTUALLY DIVISIBLE SEMIGROUPS.BOOK RV; HARRISON MA.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 9; NO 4; PP. 329-332; BIBL. 6 REF.Article

A NOTE ON COMPLETE SETS AND TRANSITIVE CLOSUREBOOK RV; WRATHALL C.1982; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1982; VOL. 15; NO 4; PP. 311-313; BIBL. 7 REF.Article

THE INDEPENDENCE OF CERTAIN OPERATIONS ON SEMI AFLSBOOK RV; GREIBACH SA.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 4; PP. 369-385; BIBL. 31 REF.Article

REVERSAL-BOUNDED MULTIPUSHDOWN MACHINES.BAKER BS; BOOK RV.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 3; PP. 315-332; BIBL. 19 REF.; (13TH ANNU. IEEE SYMP. SWITCHING AUTOM. THEORY; COLLEGE PARK, MD.; 1972)Conference Paper

ON LANGUAGES SPECIFIED BY RELATIVE ACCEPTANCEBOOK RV; WRATHALL C.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 2; PP. 185-195; BIBL. 25 REF.Article

RELATIVIZING TIME, SPACE, AND TIME-SPACEBOOK RV; WILSON CB; MEI RUI X et al.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 571-581; BIBL. 17 REF.Article

RESET MACHINESBOOK RV; GREIBACH SA; WRATHALL C et al.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 3; PP. 256-276; BIBL. 17 REF.Article

RELATIVIZING TIME AND SPACEBOOK RV; WILSON CB; XU MEIRUI et al.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 254-259; BIBL. 15 REF.Conference Paper

INCLUSION COMPLETE TALLY LANGUAGES AND THE HARTMANIS-BERMAN CONJECTUREBOOK RV; WRATHALL C; SELMAN AL et al.1977; MATH. SYST. THEORY; USA; DA. 1977; VOL. 11; NO 1; PP. 1-8; BIBL. 13 REF.Article